Chapter 26 Tail Inequalities
نویسنده
چکیده
Theorem 26.1.2 (Chebychev inequality) Let X be a random variable with μx = E[X] and σx be the standard deviation of X. That is σX = E [ (X − μx) ] . Then, Pr [|X − μX | ≥ tσX] ≤ 1 t2 . Proof: Note that Pr [|X − μX | ≥ tσX] = Pr[(X − μX) ≥ t2σ2X] . Set Y = (X − μX). Clearly, E [ Y ] = σX. Now, apply Markov inequality to Y . This work is licensed under the Creative Commons Attribution-Noncommercial 3.0 License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/3.0/ or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, California, 94105, USA.
منابع مشابه
Some Probability Inequalities for Quadratic Forms of Negatively Dependent Subgaussian Random Variables
In this paper, we obtain the upper exponential bounds for the tail probabilities of the quadratic forms for negatively dependent subgaussian random variables. In particular the law of iterated logarithm for quadratic forms of independent subgaussian random variables is generalized to the case of negatively dependent subgaussian random variables.
متن کاملNitrogen and carbon isotope signatures in cattle hair – recorders of agroecosystem processes
...........................................................................................I Zusammenfassung ...................................................................................III List of Figures .........................................................................................VI List of Tables .................................................................................
متن کاملTail inequalities for sums of random matrices that depend on the intrinsic dimension
This work provides exponential tail inequalities for sums of random matrices that depend only on intrinsic dimensions rather than explicit matrix dimensions. These tail inequalities are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit matrix dimensions replaced by a trace quantity that can be small even when the explicit dimensions are large...
متن کاملInequalities between hypergeometric tails
A special inequality between the tail probabilities of certain related hypergeometrics was shown by Seneta and Phipps [19] to suggest useful ‘quasi-exact’ alternatives to Fisher’s [5] Exact Test. With this result as motivation, two inequalities of Hájek and Havránek [6] are investigated in this paper and are generalised to produce inequalities in the form required. A parallel inequality in bino...
متن کاملLaws of Large Numbers and Tail Inequalities for Random Tries and Patricia Trees
We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. If Hn is the height of this tree, we show that Hn/E{Hn} tends to one in probability. Additional tail inequalities are given for the height, depth, size, and profile of these trees and ordinary tries that apply without any conditions on the strin...
متن کامل